- plane triangulations
- • равнинна триангулация
English-Bulgarian polytechnical dictionary . 2013.
plane triangulations
Look at other dictionaries:
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Grafo cuadrado — Un grafo cuadrado. En teoría de grafos, un grafo cuadrado es un grafo no dirigido que puede dibujarse en el plano de modo que cada superficie acotada es un cuadrilátero y cada vértice con tres o menos vecinos es incidente a una cara no acotada.… … Wikipedia Español
Grafo mediano — El mediano de tres vértices en un grafo mediano. En matemática, y más específicamente en la teoría de grafos, un grafo mediano es un grafo no dirigido en que cualesquiera tres vértices a, b, y c tienen un único mediano. Un mediano es un vértice… … Wikipedia Español
Pseudotriangle — In Euclidean plane geometry, a pseudotriangle is the simply connected subset of the plane that lies between any three mutually tangent convex sets. A pseudotriangulation is a partition of a region of the plane into pseudotriangles, and a pointed… … Wikipedia
Delaunay triangulation — A Delaunay triangulation in the plane with circumcircles shown In mathematics and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of… … Wikipedia
Geometric graph theory — In mathematics, a geometric graph is a graph in which the vertices or edges are associated with geometric objects or configurations. Geometric graph theory is a specialization of graph theory that studies geometric graphs. Notable geometric… … Wikipedia
Euclidean minimum spanning tree — The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of points in the plane (or more generally in Bbb{R}^n), where the weight of the edge between each pair of points is the distance between those two points. In simpler… … Wikipedia
GÉODÉSIE — La géodésie (du grec 塚兀, la terre ; 嗀見晴﨎晴益, diviser) s’est développée à partir des méthodes d’arpentage, nécessaires pour la délimitation précise des propriétés rurales, dès la plus haute antiquité. La compétence des opérateurs s’est… … Encyclopédie Universelle
Triangulation (topology) — In mathematics, topology generalizes the notion of triangulation in a natural way as follows: A triangulation of a topological space X is a simplicial complex K , homeomorphic to X , together with a homeomorphism h : K o X . Triangulation is… … Wikipedia
Planar straight-line graph — (PSLG) is a term used in computational geometry for an embedding of a planar graph in the plane such that its edges are mapped into straight line segments. [cite book author = Franco P. Preparata and Michael Ian Shamos | title = Computational… … Wikipedia
Catégorie des variétés différentielles — Variété (géométrie) Pour les articles homonymes, voir Variété. Réalisation du ruban de Möbius, à partir du collage d une bande de papier. Le bord n est que d … Wikipédia en Français
